Phylogenetic Network Inferences Through Efficient Haplotyping
نویسندگان
چکیده
The genotype phasing problem is to determine the haplotypes of diploid individuals from their genotypes where linkage relationships are not known. Based on the model of perfect phylogeny, the genotype phasing problem can be solved in linear time. However, recombinations may occur and the perfect phylogeny model thus cannot interpret genotype data with recombinations. This paper develops a graph theoretical approach that can reduce the problem to finding a subgraph pattern contained in a given graph. Based on ordered graph tree decomposition, this problem can be solved efficiently with a parameterized algorithm. Our tests on biological genotype data showed that this algorithm is extremely efficient and its interpretation accuracy is better than or comparable with that of other approaches.
منابع مشابه
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
The problem of determining haplotypes from genotypes has gained considerable prominence in the research community since the beginning of the HapMap project. Here the focus is on determining the sets of SNP values of individual chromosomes (haplotypes), since such information better captures the genetic causes of diseases. One of the main algorithmic tools for haplotyping is based on the assumpt...
متن کاملInfluence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data
Haplotyping, also known as haplotype phase prediction, is the problem of predicting likely haplotypes based on genotype data. One fast haplotyping method is based on an evolutionary model where a perfect phylogenetic tree is sought that explains the observed data. Unfortunately, when data entries are missing, as is often the case in real laboratory data, the resulting formal problem IPPH, which...
متن کاملPhylogeny- and Parsimony-Based Haplotype Inference with Constraints
Haplotyping, also known as haplotype phase prediction, is the problem of predicting likely haplotypes based on genotype data. One fast computational haplotyping method is based on an evolutionary model where a perfect phylogenetic tree is sought that explains the observed data. In their CPM’09 paper, Fellows et al. studied an extension of this approach that incorporates prior knowledge in the f...
متن کاملPhylogeny- and Parsimony-Based Haplotype Inference with Constraints1
Haplotyping, also known as haplotype phase prediction, is the problem of predicting likely haplotypes based on genotype data. One fast computational haplotyping method is based on an evolutionary model where a perfect phylogenetic tree is sought that explains the observed data. An extension of this approach tries to incorporate prior knowledge in the form of a set of candidate haplotypes from w...
متن کاملEfficient Computation of Template Matrices
The computation of template matrices is the bottleneck of simple algorithms for perfect phylogeny haplotyping and for perfect phylogeny under mutation and constrained recombination. The fastest algorithms known so far compute them in O(nm) time. In this paper, we describe an algorithm for computing template matrices in O(nm/ log(n)) time. We also present and discuss a conjecture that implies an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006